G-PRIMER: greedy algorithm for selecting minimal primer set
نویسندگان
چکیده
منابع مشابه
G-PRIMER: greedy algorithm for selecting minimal primer set
UNLABELLED G-PRIMER, a web-based primer design program, has been developed to compute a minimal primer set specifically annealed to all the open reading frames in a given microbial genome. This program has been successfully used in the microarray experiment for analyzing the expression of genes in the Xanthomonas campestris genome. AVAILABILITY It is available at http://mammoth.bii.a-star.edu...
متن کاملAn efficient algorithm for minimal primer set selection
SUMMARY We have developed U-PRIMER, a primer design program, to compute a minimal primer set (MPS) for any given set of DNA sequences. The U-PRIMER algorithm, which uses automatic variable fixing and automatic redundant constraint elimination to tackle the binary integer programming problem associated with the MPS selection problem. The program has been tested successfully with 32 adipocyte dev...
متن کاملGreedy Heuristics for Degenerate Primer Selection
Amplification of multiple DNA sequences in a single Polymerase Chain Reaction (PCR) experiment, called Multiplex PCR (MPPCR), is a widely known laboratory technique that requires efficient selection of a set of synthetic strings called Degenerate Primers to result in successful PCR products. The Multiple Degenerate Primer Selection Problem (MDPSP) is a fundamental problem in molecular biology a...
متن کاملAnswer Set Programming: A Primer
Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attention during the last years. This article is a gentle introduction to the subject; it starts with motivation and follows the historical development of the challenge of defining a semantics for logic programs with negation. It looks...
متن کاملMinimal primer and primer-free SELEX protocols for selection of aptamers from random DNA libraries.
Standard systematic evolution of ligands by exponential enrichment (SELEX) protocols require libraries that contain two primers, one on each side of a central random domain, which allow amplification of target-bound sequences via PCR or RT-PCR. However, these primer sequences cause nonspecific binding by their nature (generally adding about 20 nt on each end of the random sequence of about 30-4...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2004
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/bth259